Unconditionally Secure Multi-Party Computation
نویسنده
چکیده
The most general type of multi-party computation involves n participants. Participant i supplies private data xi and obtains an output function fi(x1, . . . , xn). The computation is said to be unconditionally secure if each participant can verify, with probability arbitrarily close to one, that every other participant obtains arbitrarily little information beyond their agreed output fi. We give a general proof that all multi-party computations can be implemented in a way which is unconditionally secure if they are carried out on a quantum computer. PACS numbers: 03.65.Bz, 42.50.Dv, 89.70.+c Electronic address: [email protected]
منابع مشابه
Efficient Secure Multi-party Computation
Since the introduction of secure multi-party computation, all proposed protocols that provide security against cheating players suffer from very high communication complexities. The most efficient unconditionally secure protocols among n players, tolerating cheating by up to t < n/3 of them, require communicating O(n6) field elements for each multiplication of two elements, even if only one pla...
متن کاملUnconditionally Secure Computation on Large Distributed Databases with Vanishing Cost
Consider a network of k parties, each holding a long sequence of n entries (a database), with minimum vertex-cut greater than t. We show that any empirical statistic across the network of databases can be computed by each party with perfect privacy, against any set of t ¡ k=2 passively colluding parties, such that the worst-case distortion and communication cost (in bits per database entry) bot...
متن کاملUnconditionally Secure Multi-party Computation from Weak Primitives
Let us assume that old friends meet again, after a long time. Both have become millionaires since that last time they met would like to find out who has been more successful in making money. However, they don't want the other to find out how much they earn, they both only want to get to know one bit of information. This problem is an example of secure multi-party computation, which has been int...
متن کاملImpossibility of unconditionally secure scalar products
The ability to perform scalar products of two vectors, each known to a different party, is a central problem in privacy preserving data mining and other multi party computation problems. Ongoing search for both efficient and secure scalar product protocols has revealed that this task is not easy. In this paper we show that, indeed, scalar products can never be made secure in the information the...
متن کاملGeneral Adversaries in Unconditional Multi-party Computation
We consider a generalized adversary model for unconditionally secure multi-party computation. The adversary can actively corrupt (i.e. take full control over) a subset D P of the players, and, additionally , can passively corrupt (i.e. read the entire information of) another subset E P of the players. The adversary is characterized by a generalized adversary structure, i.e. a set of pairs (D; E...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997